Design of a High Speed FFT Processor

The Discrete Fourier Transform (DFT) is used to transform the samples in time domain into frequency domain coefficients. The Fast Fourier Transform (FFT) is a widely used algorithm that computes the Discrete Fourier Transform (DFT) using much less operations than a direct realization of the DFT. FFTs is of great significance to a wide variety of applications such as data compression, spectral analysis etc. This paper proposes a design that implements a Fast Fourier transform (FFT). The module is developing by Radix2, Radix-4 decimation in time algorithm structure. The operation of the FFT processor performs three main processes i.e. data load, compute and result unload. The processing cycle starts with the data load process. In this process sampled data is read in and stored in memory. During the compute process computation of FFT on the stored data is performed and result unloaded process makes the FFT results available at its output. This paper also compares the performance of Radix-2 algorithm with Radix-4 algorithm. Keywords-DFT, FFT, Processor, Radix-2 algorithm, Radix-4 algorithm